Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits
نویسندگان
چکیده
It is well known that RN has subspaces of dimension proportional to N on which the l1 norm is equivalent to the l2 norm; however, no explicit constructions are known. Extending earlier work by Artstein– Avidan and Milman, we prove that such a subspace can be generated using O(N) random bits.
منابع مشابه
Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction
It has been known since 1970’s that the N-dimensional l1space contains nearly Euclidean subspaces whose dimension is Ω(N). However, proofs of existence of such subspaces were probabilistic, hence non-constructive, which made the results not-quite-suitable for subsequently discovered applications to high-dimensional nearest neighbor search, error-correcting codes over the reals, compressive sens...
متن کاملAlmost-Euclidean Subspaces of 1N via Tensor Products: A Simple Approach to Randomness Reduction
It has been known since 1970’s that the N-dimensional l1space contains nearly Euclidean subspaces whose dimension is Ω(N). However, proofs of existence of such subspaces were probabilistic, hence non-constructive, which made the results not-quite-suitable for subsequently discovered applications to high-dimensional nearest neighbor search, error-correcting codes over the reals, compressive sens...
متن کاملThe Packing Density of the n-Dimensional Cross-Polytope
The packing density of the regular cross-polytope in Euclidean n-space is unknown except in dimensions 2 and 4 where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus [9] who proved that for n = 3 the packing density of the regular octahedron is at most 1 − 1.4 . . .× 10. In this paper, we prove upper bounds for the packing density of the n-dimensional regular cross-...
متن کاملAlmost Euclidean subspaces of ℓ1N via expander codes
We give an explicit (in particular, deterministic polynomial time) construction of subspaces X ⊆ RN of dimension (1− o(1))N such that for every x ∈ X, (logN)−O(log log logN) √ N ‖x‖2 6 ‖x‖1 6 √ N ‖x‖2. If we are allowed to use N1/ log logN 6 No(1) random bits and dim(X) > (1 − η)N for any fixed constant η, the lower bound can be further improved to (logN)−O(1) √ N‖x‖2. Through known connections...
متن کاملAN EXTREMUM PROPERTY CHARACTERIZING THE n-DIMENSIONAL REGULAR CROSS-POLYTOPE
In the spirit of the Genetics of the Regular Figures, by L. Fejes Tóth [FT, Part 2], we prove the following theorem: If 2n points are selected in the n-dimensional Euclidean ball Bn so that the smallest distance between any two of them is as large as possible, then the points are the vertices of an inscribed regular cross-polytope. This generalizes a result of R.A. Rankin [R] for 2n points on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 14 شماره
صفحات -
تاریخ انتشار 2007